a0(980)→γγ and f0(980)→γγ: a consistent description
نویسندگان
چکیده
منابع مشابه
Consistent Query Answering over Description Logic Ontologies
Description Logics (DLs) have been widely used in the last years as formal language for specifying ontologies. In several contexts, as ontology-based data integration, it may frequently happen that data contradict the intensional knowledge provided by the ontology through which they are accessed, which therefore may result inconsistent. In this paper, we analyze the problem of consistent query ...
متن کاملSelf-consistent description of nuclear compressional modes
Isoscalar monopole and dipole compressional modes are computed for a variety of closed-shell nuclei in a relativistic random-phase approximation to three different parametrizations of the Walecka model with scalar self-interactions. Particular emphasis is placed on the role of self-consistency which by itself, and with little else, guarantees the decoupling of the spurious isoscalar-dipole stre...
متن کاملConsistent-histories Description of a World with Increasing Entropy
1. Attempt at a self-contained quantum description The consistent-histories program 1,2,3 represents a more concerted effort than previous attempts to overcome what some workers regard as the main defect of the Copenhagen interpretation: the need to invoke the existence of a classical world as a precondition to the meaningful interpretation of quantum mechanics. Hence, just as for any other att...
متن کاملTriaxially deformed sodium clusters in a self-consistent microscopic description
We have performed self-consistent Kohn-Sham calculations for the triaxially deformed sodium clusters Nal2 and Nat4. We use the jellium approach and compute the properties of the valence electrons with an exchange-correlation energy functional in the local density approximation. In both clusters a pronounced shape isomerism is obtained. We find a well-developed triaxial groundstate deformation f...
متن کاملA Totally Unimodular Description of the Consistent Value Polytope
We present a theoretical study on the idea of using mathematical programming relaxations for filtering binary constraint satisfaction problems. We introduce the consistent value polytope and give a linear programming description that is provably tighter than a recently studied formulation. We then provide an experimental study that shows that, despite the theoretical progress, in practice filte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physics Letters B
سال: 1999
ISSN: 0370-2693
DOI: 10.1016/s0370-2693(99)00400-1